What does the following function do?int fun(int x, int y){if (y == 0) return 0;return (x + fun(x, y-1));a)x + yb)x + x*yc)x*yd)xyCorrect answer is option 'C'. Can you explain this answer?

Question

What does the following function do?int fun(int x, int y){if (y == 0)  return 0;return (x + fun(x, y-1));a)x + yb)x + x*yc)x*yd)xyCorrect answer is option 'C'. Can you explain this answer?

Answer

The function adds x to itself y times which is x*y.

Answer

Explanation:

The given function takes two integer parameters x and y and returns the product of x and y using recursion.

Algorithm:

1. Check if y is equal to 0.
2. If yes, return 0.
3. If no, call the function recursively with x and y-1 as parameters.
4. Multiply the result obtained from the recursive call with x and return the value.

Example:

Let's take an example to understand how the function works.

If x = 5 and y = 3, then the function call will be:

fun(5, 3)

Since y is not equal to 0, the function will call itself recursively with fun(5, 2).

fun(5, 2) will call fun(5, 1), which will call fun(5, 0).

Since y is now equal to 0, the function will return 0.

fun(5, 1) will now return 5 * 0, which is 0.

fun(5, 2) will return 5 * 0, which is 0.

Finally, fun(5, 3) will return 5 * 0, which is 0.

Therefore, the function will return 0 when y is equal to 0, and otherwise, it will recursively call itself with y-1 as the new parameter until y becomes 0.

Similar Computer Science Engineering (CSE) Doubts

What does the following function do?int fun(int x, int y){ if (y == 0) return 0; return (x + fun(x, y-1));}

What does the following function do for a given binary tree?int fun(struct node *root){if (root == NULL) return 0; if (root-left == NULL root-right == NULL) return 0; return 1 + fun(root-left) + fun(root-right);}

What does the following function do?int fun(unsigned int n){if (n == 0 || n == 1)return n;if (n%3 != 0)return 0;return fun(n/3);}

What does fun2() do in general?int fun(int x, int y){if (y == 0) return 0;return (x + fun(x, y-1));}int fun2(int a, int b){if (b == 0) return 1;return fun(a, fun2(a, b-1));}

Consider the following recursive function fun(x, y). What is the value of fun(4, 3)int fun(int x, int y){ if (x == 0) return y; return fun(x - 1, x + y);

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2026 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

Top Courses for Computer Science Engineering (CSE)

Related Content

Mock Test Series

Subject-wise Courses

Subject-wise Courses

Other Engg Branches

Company